منابع مشابه
An Upward Measure Separation Theorem
It is shown that almost every language in ESPACE is very hard to approximate with circuits It follows that P BPP implies that E is a measure subset of ESPACE
متن کاملUpward Morley's theorem downward
By a celebrated theorem of Morley, a theory T is א1-categorical if and only if it is κ-categorical for all uncountable κ. In this paper we are taking the first steps towards extending Morley’s categoricity theorem “to the finite”. In more detail, we are presenting conditions, implying that certain finite subsets of certain א1-categorical T have at most one n-element model for each natural numbe...
متن کاملUpward Separation for FewP and Related Classes
This paper studies the range of application of the upward separation technique that has been introduced by Hartmanis to relate certain structural properties of polynomial-time complexity classes to their exponential-time analogs and was rst applied to NP [Har83]. Later work revealed the limitations of the technique and identi ed classes defying upward separation. In particular, it is known that...
متن کاملUpward separations and weaker hypotheses in resource-bounded measure
We consider resource-bounded measure in double-exponential-time complexity classes. In contrast to complexity class separation translating downwards, we show that measure separation translates upwards. For example, μp(NP) 6= 0⇒ μe(NE) 6= 0⇒ μexp(NEXP) 6= 0. We also show that if NE does not have e-measure 0, then the NP-machine hypothesis holds. We give oracles relative to which the converses of...
متن کاملSeparation Theorem for Linearly Constrained
We solve the linearly constrained linear-quadratic LQ and linear-quadratic-Gaussian LQG optimal control problems. Closed form expressions of the optimal controls are derived, and the Separation Theorem is generalized.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1991
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90320-2